Axiomatizing GSOS with Predicates

نویسندگان

  • Luca Aceto
  • Georgiana Caltais
  • Eugen-Ioan Goriac
  • Anna Ingólfsdóttir
چکیده

In this paper, we introduce an extension of the GSOS rule format with predicates such as termination, convergence and divergence. For this format we generalize the technique proposed by Aceto, Bloom and Vaandrager for the automatic generation of ground-complete axiomatizations of bisimilarity over GSOS systems. Our procedure is implemented in a tool that receives SOS specifications as input and derives the corresponding axiomatizations automatically. This paves the way to checking strong bisimilarity over process terms by means of theorem-proving techniques.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Axiomatizing GSOS with Termination

We discuss a combination of GSOS-type structural operational semantics with explicit termination, that we call the tagh-format (tagh being short for termination and GSOS hybrid). The tagh-format distinguishes between transition and termination rules, but allows besides active and negative premises as in GSOS,. also for, what is called terminating and passive arguments. We extend the result of A...

متن کامل

Proving the validity of equations in GSOS languages using rule-matching bisimilarity

This paper presents a bisimulation-based method for establishing the soundness of equations between terms constructed using operations whose semantics is specified by rules in the GSOS format of Bloom, Istrail and Meyer. The method is inspired by de Simone’s FH-bisimilarity and uses transition rules as schematic transitions in a bisimulation-like relation between open terms. The soundness of th...

متن کامل

A Bisimulation-based Method for Proving the Validity of Equations in GSOS Languages

This paper presents a bisimulation-based method for establishing the soundness of equations between terms constructed using operations whose semantics is specified by rules in the GSOS format of Bloom, Istrail and Meyer. The method is inspired by de Simone’s FH-bisimilarity and uses transition rules as schematic transitions in a bisimulation-like relation between open terms. The soundness of th...

متن کامل

PREG Axiomatizer - A Ground Bisimilarity Checker for GSOS with Predicates

PREG Axiomatizer is a tool used for proving strong bisimilarity between ground terms consisting of operations in the GSOS format extended with predicates. It automatically derives sound and groundcomplete axiomatizations using a technique proposed by the authors of this paper. These axiomatizations are provided as input to the Maude system, which, in turn, is used as a reduction engine for prov...

متن کامل

Natural Quantum Operational Semantics with Predicates

A general definition of a quantum predicate and quantum labelled transition systems for finite quantum computation systems is presented. The notion of a quantum predicate as a positive operator-valued measure is developed. The main results of this paper are a theorem about the existence of generalised predicates for quantum programs defined as completely positive maps and a theorem about the ex...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011